Edge-bipancyclicity of star graphs with faulty elements
نویسندگان
چکیده
منابع مشابه
Edge-bipancyclicity of star graphs under edge-fault tolerant
The star graph Sn is one of the most famous interconnection networks. It has been shown by Li [T.-K. Li, Cycle embedding in star graphs with edge faults, Appl. Math. Comput. 167 (2005) 891–900] that Sn contains a cycle of length from 6 to n! when the number of fault edges in the graph does not exceed n 3. In this paper, we improve this result by showing that for any edge subset F of Sn with jFj...
متن کاملEdge-bipancyclicity of conditional faulty hypercubes
Xu et al. showed that for any set of faulty edges F of an n-dimensional hypercube Qn with |F | n− 1, each edge of Qn − F lies on a cycle of every even length from 6 to 2n, n 4, provided not all edges in F are incident with the same vertex. In this paper, we find that under similar condition, the number of faulty edges can be much greater and the same result still holds. More precisely, we show ...
متن کاملEdge-pancyclicity and edge-bipancyclicity of faulty folded hypercubes
Let Fv and Fe be sets of faulty vertices and faulty edges, respectively, in the folded hypercube FQn so that |Fv| + |Fe| ≤ n − 2, for n ≥ 2. Choose any fault-free edge e. If n ≥ 3 then there is a fault-free cycle of length l in FQn containing e, for every even l ranging from 4 to 2 − 2|Fv |; if n ≥ 2 is even then there is a fault-free cycle of length l in FQn containing e, for every odd l rangi...
متن کاملEdge-bipancyclicity of a hypercube with faulty vertices and edges
A bipartite graph G = (V ,E) is said to be bipancyclic if it contains a cycle of every even length from 4 to |V |. Furthermore, a bipancyclic G is said to be edge-bipancyclic if every edge of G lies on a cycle of every even length. Let Fv (respectively, Fe) be the set of faulty vertices (respectively, faulty edges) in an n-dimensional hypercube Qn. In this paper, we show that every edge of Qn−F...
متن کاملOn Edge-Decomposition of Cubic Graphs into Copies of the Double-Star with Four Edges
A tree containing exactly two non-pendant vertices is called a double-star. Let $k_1$ and $k_2$ be two positive integers. The double-star with degree sequence $(k_1+1, k_2+1, 1, ldots, 1)$ is denoted by $S_{k_1, k_2}$. It is known that a cubic graph has an $S_{1,1}$-decomposition if and only if it contains a perfect matching. In this paper, we study the $S_{1,2}$-decomposit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2011
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2011.09.006